Linear size test sets for certain commutative languages

Parikh test sets for commutative languages

A set T ⊆ L is a Parikh test set of L iff c(T ) is a test set of c(L). We give an effective characterization of Parikh test sets for arbitrary commutative language.

Optimal Test Sets for Context-Free Languages

A test set for a formal language (set of strings) L is a subset T of L such that for any two string homomorphisms f and g defined on L, if the restrictions of f and g on T are identical functions, then f and g are identical on the entire L. Previously, it was shown that there are context-free grammars for which smallest test sets are cubic in the size of the grammar, which gives a lower bound o...

Size of Nondeterministic and Deterministic Automata for Certain Languages

In the theory of automata the question about difference between the size of deterministic and nondeterministic automata which recognize the same language is of great importance. However, this problem has been studied mainly in case when input alphabet consists of at least 2 letters. In this paper some special kind of languages in one letter alphabet will be discussed and the estimate of the num...

Learning Commutative Regular Languages

Procedures for Reducing the Size of Coverage-based Test Sets

This paper addresses the problem of reducing the size of test sets for regression testing and test output inspection Since regression testing requires the execution of some and in the worst case all test cases reducing the number of tests can have a large bene t Additionally testers generally have to examine the output of each test case both during initial and regression testing Since this is d...